Rewriting and Well-Definedness within a Proof System
نویسندگان
چکیده
منابع مشابه
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with pot...
متن کاملModular Well-Definedness Analysis for Attribute Grammars
Extension developers deal with errors User has no conflict errors The full solution consists of: Forwarding Van Wyk. de Moor. Backhouse. Kwiathowski. "Forwarding in attribute grammars for modular language design." CC '02 Copper's modular analysis for syntax Schwerdfeger. Van Wyk. "Verifiable composition of deterministic grammars." PLDI '09 Silver's modular analysis for semantics Kaminski. Van W...
متن کاملWell-Definedness of Streams by Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a TRS in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. As a consequence, proving such well-definedness of several interesting stream spec...
متن کاملA Tool Proving Well-Definedness of Streams Using Termination Tools
A stream specification is a set of equations intended to define a stream, that is, an infinite sequence over a given data type. In [5] a transformation from such a stream specification to a TRS is defined in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. In this tool description we present how proving such well-definedness of sev...
متن کاملRewriting, Inference, and Proof
Rewriting is a form of inference, and one that interacts in several ways with other forms of inference such as decision procedures and proof search. We discuss a range of issues at the intersection of rewriting and inference. How can other inference procedures be combined with rewriting? Can rewriting be used to describe inference procedures? What are some of the theoretical challenges and prac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.43.4